A One Pass Algorithm for Compiling ALGOL 68 Declarations

نویسنده

  • Victor B. Schneider
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

36 Algorithm

Algol 68 is considerably more difficult to learn than Pascal, partly due to the unusual terminology of Algol 68, which has not been widely accepted. The defining document of Algol 68 is much more elaborate and precise than the Pascal Report, but is also much more difficult to understand than the shorter and less formal Pascal document. This applies, in particular, to the two-level context-sensi...

متن کامل

Ackermann’s Function: a Study in the Efficiency of Calling Procedures

A six line recursive procedure is used to assess the efficiency of the procedure calling mechanism in ALGOL-like languages. The results from some 40 systems varying from ALGOL 68 and PL/I to System Implementation Languages for minicomputers are presented and compared. A hundred to one variation in performance occurs with this test, the major reasons for which are given. Received April 17, 1975....

متن کامل

Programming in several dimensions

Writing a program to solve a problem is a process that can be divided into two phases: first, we invent a mental model of the solution; secondly, we map the mental model onto a physical representation. The mental model is multidimensional and syntax-free; in today’s textual programming languages, the physical representation is singledimensional and syntax-burdened. In fact, it hasn’t changed gr...

متن کامل

The regular-language semantics of second-order idealized ALGOL

We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our model inherits its good theoretical properties; in fact, for second-order IA taken as a stand-alone langua...

متن کامل

On the construction of persistent programming environments

This thesis presents research into the construction of persistent programming systems. Much of the thesis is concerned with the design and implementation of persistent programming languages, in particular PS-algol and Napier. Both languages support machine independent vector and raster graphics data types. Napier provides an environment mechanism that enables the incremental construction and bi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013